Multiplier-less and Table-less Linear Approximation for Square-Related Functions
نویسندگان
چکیده
منابع مشابه
Multiplier-less and Table-less Linear Approximation for Square-Related Functions
Square-related functions such as square, inverse square, square-root and inverse square-root operations are widely used in digital signal processing and digital communication algorithms, and their efficient realizations are commonly required to reduce the hardware complexity. In the implementation point of view, approximate realizations are often desired if they do not degrade performance signi...
متن کاملApproximation Method for High Speed Multiplier-Less Dwt Architecture
This paper presents a VLSI design approach for a high speed and real time Discrete Wavelet Transform computing. The hardware requirement is a major concern in the computation of discrete wavelet transform. There are many multiplier-less architecture for DWT for reducing the hardware requirement. But it is observed that the approximation method for constant multiplier implementation in DWT can i...
متن کاملRandomized sampling and multiplier-less filtering
This thesis considers the benefits of randomization in two fundamental signal processing techniques: sampling and filtering. The first part develops randomized non-uniform sampling as a method to mitigate the effects of aliasing. Randomization of the sampling times is shown to convert aliasing error due to uniform under-sampling into uncorrelated shapeable noise. In certain applications, especi...
متن کاملNovel design of multiplier-less FFT processors
This paper presents a novel and hardware-efficient architecture for power-of-two FFT processors. The proposed design is based on the phase-amplitude splitting technique which converts a DFT to cyclic convolutions and additions. The cyclic convolutions are implemented with a filter-like structure and the additions are computed with several stages of butterfly processing units. The proposed archi...
متن کاملCoefficient optimization for area-effective multiplier-less FIR filters
This paper presents the systematic synthesis of multiplier-less FIR filters with a novel complexity-aware quantization algorithm. Both signed-digit representations and common subexpression elimination (CSE) are investigated to reduce the computational complexity at the bit level. For comparable filter responses, the simulation shows that our approach requires only half (49.06%~ 50.94%) addition...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Transactions on Information and Systems
سال: 2010
ISSN: 0916-8532,1745-1361
DOI: 10.1587/transinf.e93.d.2979